Quickest online selection of an increasing subsequence of specified size
نویسندگان
چکیده
Given a sequence of independent random variables with a common continuous distribution, we consider the online decision problem where one seeks to minimize the expected value of the time that is needed to complete the selection of a monotone increasing subsequence of a prespecified length n. This problem is dual to some online decision problems that have been considered earlier, and this dual problem has some notable advantages. In particular, the recursions and equations of optimality lead with relative ease to asymptotic formulas for mean and variance of the minimal selection time. Mathematics Subject Classification (2010): Primary: 60C05, 90C40; Secondary: 60G40, 90C27, 90C39
منابع مشابه
A O(logn)-OPTIMAL POLICY FOR THE ONLINE SELECTION OF A MONOTONE SUBSEQUENCE FROM A RANDOM SAMPLE
Given a sequence of n independent random variables with common continuous distribution, we propose a simple adaptive online policy that selects a monotone increasing subsequence. We show that the expected number of monotone increasing selections made by such policy is within O(logn) of optimal. Our construction provides a direct and natural way for proving the O(logn)-optimality gap. An earlier...
متن کاملAn adaptive O(log n)-optimal policy for the online selection of a monotone subsequence from a random sample
Given a sequence of n independent random variables with common continuous distribution, we propose a simple adaptive online policy that selects a monotone increasing subsequence. We show that the expected number of monotone increasing selections made by such a policy is within O(logn) of optimal. Our construction provides a direct and natural way for proving the O(logn)-optimality gap. An earli...
متن کاملEfficient Identification of Common Subsequences from Big Data Streams Using Sliding Window Technique
We propose an efficient Frequent Sequence Stream algorithm for identifying the top k most frequent subsequences over big data streams. Our Sequence Stream algorithm gains its efficiency by its time complexity of linear time and very limited space complexity. With a pre-specified subsequence window size S and the k value, in very high probabilities, the Sequence Stream algorithm retrieve the top...
متن کاملOnline Streaming Feature Selection Using Geometric Series of the Adjacency Matrix of Features
Feature Selection (FS) is an important pre-processing step in machine learning and data mining. All the traditional feature selection methods assume that the entire feature space is available from the beginning. However, online streaming features (OSF) are an integral part of many real-world applications. In OSF, the number of training examples is fixed while the number of features grows with t...
متن کاملA Prophet Inequality for On-line Selection of a Monotone Subsequence of a Random Sample
A brief proof is given for an upper bound on expected length of the optimal on-line selection of a monotone subsequence from a finite random sequence. The bound is valid for all sample sizes and it is sharp for large samples. We also provide a bound on the variance of the length of the optimal subsequence. Mathematics Subject Classification (2000): Primary 60C05, Secondary 60G42
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Random Struct. Algorithms
دوره 49 شماره
صفحات -
تاریخ انتشار 2016